A remark on pseudo proof systems and hard instances of SAT∗
نویسندگان
چکیده
We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so-called pseudo proof systems proposed for study by Kraj́ıček. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. We show that the existence of mad pseudo proof systems is equivalent to the existence of a randomized polynomial time procedure with a highly restrictive use of randomness which produces satisfiable formulas whose satisfying assignments are probably hard to find.
منابع مشابه
Pseudo proof systems and hard instances of SAT ∗ – Preprint –
We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so-called pseudo proof systems proposed for study by Kraj́ıček. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. Speaking in standard terms, pseudo-proof systems are propositional proof systems that are unsound in the sense that t...
متن کاملA Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretically explained by showing that the clause learning framework is an implementation of a proof system which is as poweful as resolution. However, exponential lower bounds are known for resolution, which suggests that signi...
متن کاملOn the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)
This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.
متن کاملA Verified Decision Procedure for Pseudo-Boolean Formulas
Pseudo-Boolean formulas consist of constraints of the form ∑i=1 wi · xi k, where xi are propositional literals, wi ∈ Z, k ∈ Z, and arise in planning, scheduling and optimization problems. We describe an efficient and easily verifiable decision procedure for pseudo-Boolean formulas, that is based on encoding PB formulas into the propositional satisfiability problem with the cutting-edge sequenti...
متن کاملA short remark on the result of Jozsef Sandor
It is pointed out that, one of the results in the recently published article, ’On the Iyengar-Madhava Rao-Nanjundiah inequality and it’s hyperbolic version’ [3] by J´ozsef S´andor is logically incorrect and new corrected result with it’s proof is presented.
متن کامل